Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption
نویسندگان
چکیده
Container terminals mainly include three types of handling equipment, i.e., quay cranes (QCs), internal trucks (ITs) and yard cranes (YCs). Due to high cost of the handling equipment, container terminals can hardly purchase additional handling equipment. Therefore, the reasonable scheduling of these handling equipment, especially coordinated scheduling of the three types of handling equipment, plays an important role in the service level and energy-saving of container terminal. This paper addresses the problem of integrated QC scheduling, IT scheduling and YC scheduling. Firstly, this problem is formulated as a mixed integer programming model (MIP), where the objective is to minimize the total departure delay of all vessels and the total transportation energy consumption of all tasks. Furthermore, an integrated simulation-based optimization method is developed for solving the problem, where the simulation is designed for evaluation and optimization algorithm is designed for searching solution space. The optimization algorithm integrates genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, where the GA is used for global search and the PSO is used for local search. Finally, numerical experiments are conducted to verify the effectiveness of the proposed method. The results show that the proposed method can coordinate the scheduling of the three types of handling equipment and can realize the optimal trade-off between time-saving and energy-saving. 2014 Elsevier Ltd. All rights reserved.
منابع مشابه
A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...
متن کاملQuay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کاملYard Crane Pools and Optimum Layouts for Storage Yards of Container Terminals
As more and more container terminals open up all over the world, competition for business is becoming very intense for container terminal operators. They are finding out that even to keep their existing Sea Line customers, they have to make them happy by offering higher quality service. The quality of service they can provide depends on their operating policies and the design of the terminal la...
متن کاملThe Integrated Optimization of Quay Crane-Yard Truck Scheduling in the Container Terminal with Uncertain Factors
The key to improve the container terminal efficiency is the integrated optimization of the quay crane (QC) and the yard truck (YT) scheduling, which is normally settled separately and considered in a certain condition in classical literatures. To improve the operation efficiency and simulate the practical operation, a PSO-based integrated QC-YT scheduling optimization model with uncertain facto...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 42 شماره
صفحات -
تاریخ انتشار 2015